
public class TestAlgorithm {

    public static void main(String[] args) {
        // dijkstra algorithm
        // DShortestPath path = new DShortestPath(5);
        // path.ComputeShortestPath();

        // heap median algorithm
        /*
         * int []testArray = new int[10000]; DataReader reader = new
         * DataReader(); reader.ReadMedianArray(testArray); MedianMaintenance mm
         * = new MedianMaintenance();
         * 
         * mm.ComputeMedian(testArray); mm.PrintMedianList();
         */

        // 2-sum hash algorithm
        // SubSumHash testSum = new SubSumHash();
        // testSum.ConstructHashTable();
        // SubSumSort testSum = new SubSumSort();
        // testSum.ConstructdataList();
        // testSum.Compute2Sum();
        // testSum.PrintData();

        // JobScheduler js = new JobScheduler();
        // js.ReadJobsData();
        // js.ComputeCompletionTime();
        // js.ComputeCompletionTimeByRatio();

        // PrimsMST pm = new PrimsMST();
        // pm.InitData();
        // pm.RunPrim();
        // pm.PrintData();

        // Clustering cluster = new Clustering();
        // cluster.InitData();
        // cluster.RunClurstering();
        // cluster.PrintData();

        /*
         * ClusteringBig cb = new ClusteringBig(); cb.InitData();
         * cb.PrintData(); cb.RunClurstering(); cb.PrintData();
         */

        // BestSearchTree bst = new BestSearchTree();
        // bst.ComputeMinTime();
        // bst.PrintData();

        // Knapsack ks = new Knapsack();
        // ks.InitData();
        // ks.PrintData();
        // ks.RunKnapsack();
		
        //KnapsackBig kb = new KnapsackBig();
        //kb.InitData();
        //kb.RunKnapSackBig();
        //kb.RunKnapSackBig2();

//        TSP tsp = new TSP();
//        tsp.InitData();
//        tsp.PrintData();

        TwoSat ts = new TwoSat();
        ts.InitData();
        ts.PrintData();

    }

}
